Approximating the piercing number for unit-height rectangles
نویسندگان
چکیده
منابع مشابه
A THEORETICALLY CORRECT RESOURCE USAGE VISUALIZATION FOR THE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM
The cumulative resource constraints of the resource-constrained project scheduling problem (RCPSP) do not treat the resource demands as geometric rectangles, that is, activities are not necessarily assigned to the same resource units over their processing times. In spite of this fact, most papers on resource-constrained project scheduling mainly in the motivation phase use a strip packing of re...
متن کاملHitting and Piercing Rectangles Induced by a Point Set
We consider various hitting and piercing problems for the family of axis-parallel rectangles induced by a point set. Selection Lemmas on induced objects are classical results in discrete geometry that have been well studied and have applications in many geometric problems like weak epsilon nets and slimming Delaunay triangulations. Selection Lemma type results typically bound the maximum number...
متن کاملOn Piercing Sets of Axis-Parallel Rectangles and Rings
We consider the p-piercing problem for axis-parallel rectangles. We are given a collection of axis-parallel rectangles in the plane, and wish to determine whether there exists a set of p points whose union intersects all the given rectangles. We present eecient algorithms for nding a piercing set (i.e., a set of p points as above) for values of p = 1; 2; 3; 4; 5. The result for 4 and 5-piercing...
متن کاملPiercing Quasi-Rectangles: On a Problem of Danzer and Rogers
It is an old problem of Danzer and Rogers to decide whether it is possible to arrange O( 1 ε ) points in the unit square so that every rectangle of area ε > 0 within the unit square contains at least one of them. We show that the answer to this question is in the negative if we slightly relax the notion of rectangles, as follows. Let δ be a fixed small positive number. A quasi-rectangle is a re...
متن کاملPiercing Axis-parallel Boxes
Given a finite family F of axis-parallel boxes in R such that F contains no k + 1 pairwise disjoint boxes, and such that for each two intersecting boxes in F a corner of one box is contained in the other box, we prove that F can be pierced by at most ck log log(k) points, where c is a constant depending only on d. We further show that in some special cases the upper bound on the number of pierc...
متن کامل